Semi%2DSupervised Classification Using Sparse Gaussian Process Regression.
Gaussian Processes (GPs) are promising Bayesian methods for classification and regression problems. They have also been used for semi-supervised learning tasks. In this paper, we propose a new algorithm for solving semi-supervised binary classification problem using sparse GP regression (GPR) models. It is closely related to semi-supervised learning based on support vector regression (SVR) and maximum margin clustering. The proposed algorithm is simple and easy to implement. It gives a sparse solution directly unlike the SVR based algorithm. Also, the hyperparameters are estimated easily without resorting to expensive cross-validation technique. Use of sparse GPR model helps in making the proposed algorithm scalable. Preliminary results on synthetic and real-world data sets demonstrate the efficacy of the new algorithm. 1
Validation%2DBased Sparse Gaussian Process Classifier Design.

Cluster Based Training for Scaling Non%2Dlinear Support Vector Machines.

Multiclass core vector machine.

A Fast Tracking Algorithm for Generalized LARS%2FLASSO.

Fast Generalized Cross%2DValidation Algorithm for Sparse Model Learning.

Cluster Based Core Vector Machine.

Minimum Enclosing Spheres Formulations for Support Vector Ordinal Regression.

An efficient clustering scheme using support vector methods.

Rough set based incremental clustering of interval data.

An Efficient Clustering Scheme using Support Vector Methods.

A Fast Dual Algorithm for Kernel Logistic Regression.
This paper gives a new iterative algorithm for kernel logistic regression. It is based
Rough support vector clustering.
Abstract—In most pattern recognition algorithms, amino acids cannot be used directly as inputs since they are nonnumerical variables. They, therefore, need encoding prior to input. In this regard, bio-basis function maps a nonnumerical sequence space to a numerical feature space. It is designed using an amino acid mutation matrix. One of the important issues for the bio-basis function is how to select the minimum set of bio-bases with maximum information. In this paper, we describe an algorithm, termed as rough-fuzzy c-medoids (RFCMdd) algorithm, to select the most informative bio-bases. It is comprised of a judicious integration of the principles of rough sets, fuzzy sets, the c-medoids algorithm, and the amino acid mutation matrix. While the membership function of fuzzy sets enables efficient handling of overlapping partitions, the concept of lower and upper bounds of rough sets deals with uncertainty, vagueness, and incompleteness in class definition. The concept of crisp lower bound and fuzzy boundary of a class, introduced in RFCMdd, enables efficient selection of the minimum set of the most informative bio-bases. Some new indices are introduced for evaluating quantitatively the quality of selected bio-bases. The effectiveness of the proposed algorithm, along with a comparison with other algorithms, has been demonstrated on different types of protein data sets. Index Terms—Pattern recognition, data mining, c-medoids algorithm, fuzzy sets, rough sets, bioinformatics. Ç 1
Predictive Approaches for Sparse Model Learning.

Multi%2Dcategory Classification by Soft%2DMax Combination of Binary Classifiers.
In this paper, we propose a multi-category classification  method that combines binary classifiers through soft-max function. Posteriori  probabilities are also obtained. Both, one-versus-all and one-versusone  classifiers can be used in the combination. Empirical comparison  shows that the proposed method is competitive with other implementations  of one-versus-all and one-versus-one methods in terms of both  classification accuracy and posteriori probability estimate.
A simple and efficient algorithm for gene selection using sparse logistic regression.

SMO Algorithm for Least%2DSquares SVM Formulation.

A Fast Dual Algorithm for Kernel Logistic Regression.
This paper gives a new iterative algorithm for kernel logistic regression. It is based
Improvements to Platt%27s SMO Algorithm for SVM Classifier Design.
This paper points out an important source of confusion and ineciency in Platt&#039;s Sequential  Minimal Optimization (SMO) algorithm that is caused by the use of a single threshold value.  Using clues from the KKT conditions for the dual problem, two threshold parameters are employed  to derive modications of SMO. These modied algorithms perform signicantly faster  than the original SMO on all benchmark datasets tried.  1 Introduction  In the past few years, there has been a lot of excitement and interest in Support Vector Machines[16, 2] because they have yielded excellent generalization performance on a wide range of problems. Recently, fast iterative algorithms that are also easy to implement have been suggested[9,4,7,3,6]. Platt&#039;s Sequential Minimization Algorithm (SMO)[9,11] is an important example. A remarkable feature of SMO is that it is also extremely easy to implement. Comparative testing against other algorithms, done by Platt, have shown that SMO is often much faster and has...
